Some Lower Bounds on Geometric Separability Problems
نویسندگان
چکیده
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show Ω(n log n) time lower bounds for separability by means of strips, wedges, wedges with apices on a given line, fixed-slopes double wedges, and triangles, which match the complexity of the existing algorithms, and therefore prove their optimality.
منابع مشابه
Some remarks on the arithmetic-geometric index
Using an identity for effective resistances, we find a relationship between the arithmetic-geometric index and the global ciclicity index. Also, with the help of majorization, we find tight upper and lower bounds for the arithmetic-geometric index.
متن کاملOn the total version of geometric-arithmetic index
The total version of geometric–arithmetic index of graphs is introduced based on the endvertex degrees of edges of their total graphs. In this paper, beside of computing the total GA index for some graphs, its some properties especially lower and upper bounds are obtained.
متن کاملOn the bounds in Poisson approximation for independent geometric distributed random variables
The main purpose of this note is to establish some bounds in Poisson approximation for row-wise arrays of independent geometric distributed random variables using the operator method. Some results related to random sums of independent geometric distributed random variables are also investigated.
متن کاملOn the Separability of Stochastic Geometric Objects, with Applications
In this paper, we study the linear separability problem for stochastic geometric objects under the wellknown unipoint/multipoint uncertainty models. Let S = SR∪SB be a given set of stochastic bichromatic points, and define n = min{|SR|, |SB |} and N = max{|SR|, |SB |}. We show that the separable-probability (SP) of S can be computed in O(nNd−1) time for d ≥ 3 and O(min{nN logN,N}) time for d = ...
متن کاملOn the streaming complexity of fundamental geometric problems
In this paper, we focus on lower bounds and algorithms for some basic geometric problems in the one-pass (insertion only) streaming model. The problems considered are grouped into three categories — (i) Klee’s measure (ii) Convex body approximation, geometric query, and (iii) Discrepancy Klee’s measure is the problem of finding the area of the union of hyperrectangles. Under convex body approxi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 16 شماره
صفحات -
تاریخ انتشار 2006